Geometry and algorithms for upper triangular tropical matrix identities
نویسندگان
چکیده
منابع مشابه
Mixing of the Upper Triangular Matrix Walk
We study a natural random walk over the upper triangular matrices, with entries in the field Z2, generated by steps which add row i + 1 to row i. We show that the mixing time of the lazy random walk is O(n) which is optimal up to constants. Our proof makes key use of the linear structure of the group and extends to walks on the upper triangular matrices over the fields Zq for q prime.
متن کاملInvolutions and characters of upper triangular matrix groups
We study the realizability over R of representations of the group U(n) of upper-triangular n× n matrices over F2. We prove that all the representations of U(n) are realizable over R if n ≤ 12, but that if n ≥ 13, U(n) has representations not realizable over R. This theorem is a variation on a result that can be obtained by combining work of J. Arregi and A. Vera-López and of the authors, but th...
متن کاملJordan left derivations in full and upper triangular matrix rings
In this paper, left derivations and Jordan left derivations in full and upper triangular matrix rings over unital associative rings are characterized.
متن کاملCommunication-Avoiding Parallel Algorithms for Solving Triangular Matrix Equations
In this work an algorithm for solving triangular systems of equations for multiple right hand sides is presented. The algorithm for solving triangular systems for multiple right hand sides, commonly referred to as the TRSM problem, is a very important in dense linear algebra as it is a subroutine for most decompositions of matrices as LU or QR. To improve performance over the standard iterative...
متن کاملParallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations
We present parallel algorithms for triangular periodic Sylvester-type matrix equations, conceptually being the third step of a periodic Bartels–Stewart-like solution method for general periodic Sylvester-type matrix equations based on variants of the periodic Schur decomposition. The presented algorithms are designed and implemented in the framework of the recently developed HPC library SCASY a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2019
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2019.03.024